Programming and Data Structures - Graphs
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
3. The minimum number of edges in a connected cyclic graph on n vertices is
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
4. The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is
- Option : C
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
5. Which of the following is useful in traversing a given graph by breadth-first search?
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.